package 二叉树;

public class Solution7 {
    public TreeNode mergeTrees (TreeNode t1, TreeNode t2) {
        if (t1 == null) {
            return t2;
        }
        if (t2 == null) {
            return t1;
        }
        TreeNode ret = new TreeNode(t1.val + t2.val);
        ret.left = mergeTrees(t1.left,t2.left);
        ret.right = mergeTrees(t1.right,t2.right);
        return ret;
    }
}
